منابع مشابه
Reliable Computations on Faulty EREW PRAM
We consider the problem of efficient and reliable computing on EREW PRAM whose processors are subject to random independent stop-failures with constant probability p < 1. An algorithm for such a fault-prone machine is called safe if it solves a problem of size n with probability exceeding 1 d/n, for some constant d independent of n. Our main contribution is a safe algorithm for the well-known l...
متن کاملFast Deterministic Computations on a Faulty PRAM
We develop a method to simulate deterministically the operational Parallel Random Access Machine (PRAM) on a PRAM prone to processor and memory failures. It is shown that an n-processor PRAM with a bounded fraction of faulty processors and memory cells can simulate de-terministically the fully operational PRAM with O(log n) slowdown, after preprocessing performed in time O(log 2 n).
متن کاملEfficient Geometric Algorithms on the EREW PRAM
We present a technique that can be used to obtain efficient parallel algorithms in the EREW-PRAM computational model. This technique enables us to optimally solve a number of geometric problems in O(logn) time using O(n/logn) EREW-PRAM processors, where n is the input size. These problerns include: computing the convex hull oCa sorted point set in the plane, computing the convex hull oCa simple...
متن کاملPriority Queue Operations on EREW-PRAM
Using EREW-PRAM algorithms on a tournament based complete binary tree we implement the insert and extract-min operations with p = log N processors at costs O(1) and O(log log N) respectively. Previous solutions 4, 7] under the PRAM model and identical assumptions attain O(log log N) cost for both operations. We also improve on constant factors the asymptotic bound for extract-min since in it we...
متن کاملEfficient EREW PRAM Algorithms for Parentheses-Matching
We present four polylog-time parallel algorithms for matching parentheses on an exclusive-read and exclusive-write (EREW) parallel random-access machine (PRAM) model. These algorithms provide new insights into the parentheses-matching problem. The first algorithm has a time complexity of O( log’ n ) employing O( & ) processors for an input string containing ~1 parentheses. Although this algorit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1996
ISSN: 0304-3975
DOI: 10.1016/0304-3975(95)00186-7